Sorting Genomes with Centromeres by Translocations
نویسندگان
چکیده
A centromere is a special region in the chromosome that plays a vital role during cell division. Every new chromosome created by a genome rearrangement event must have a centromere in order to survive. This constraint has been ignored in the computational modeling and analysis of genome rearrangements to date. Unlike genes, the different centromeres are indistinguishable, they have no orientation, and only their location is known. A prevalent rearrangement event in the evolution of multi-chromosomal species is translocation (i.e., the exchange of tails between two chromosomes). A translocation may create a chromosome with no centromere in it. In this paper, we study for the first time centromeres-aware genome rearrangements. We present a polynomial time algorithm for computing a shortest sequence of translocations transforming one genome into the other, where all of the intermediate chromosomes must contain centromeres. We view this as a first step towards analysis of more general genome rearrangement models that take centromeres into consideration.
منابع مشابه
Rearrangements in Genomes with Centromeres Part I: Translocations
A centromere is a special region in the chromosome that plays a vital role during cell division. Every new chromosome created by a genome rearrangement event must have a centromere in order to survive. This constraint has been ignored in the computational modeling and analysis of genome rearrangements to date. Unlike genes, the different centromeres are indistinguishable, they have no orientati...
متن کاملSorting genomes by translocations and deletions.
Given two signed multi-chromosomal genomes Pi and Gamma with the same gene set, the problem of sorting by translocations (SBT) is to find a shortest sequence of translocations transforming Pi to Gamma, where the length of the sequence is called the translocation distance between Pi and Gamma. In 1996, Hannenhalli gave the formula of the translocation distance for the first time, based on which ...
متن کاملA (1.408+ε)-Approximation Algorithm for Sorting Unsigned Genomes by Reciprocal Translocations
متن کامل
Memetic and Opposition-Based Learning Genetic Algorithms for Sorting Unsigned Genomes by Translocations
A standard genetic algorithm for sorting unsigned genomes by translocations is improved in two different manners: 1. a memetic algorithm (GAMA ) is provided, which embeds a new stage of local search, based on the concept of mutation applied in only one gene; 2. an oppositionbased learning (GAOBL ) mechanism is provided, which explores the concept of internal opposition applied to a chromosome. ...
متن کاملIdentification of centromeric antigens in dicentric Robertsonian translocations: CENP-C and CENP-E are necessary components of functional centromeres.
Robertsonian translocations are the most common structural dicentric rearrangements in humans. The stability of these dicentrics is attributed to the inactivation of one centromere by mechanisms which are currently unknown. The presence and amounts of centromeric proteins (CENPs) differ between the centromeres of the few dicentrics which have been studied, providing a limited understanding of t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Journal of computational biology : a journal of computational molecular cell biology
دوره 15 7 شماره
صفحات -
تاریخ انتشار 2008